Chromatic polynomials of hypergraphs
نویسندگان
چکیده
In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique. Moreover we give some equalities for the chromatic polynomials of hypergraphs generalizing known results for graphs and hypergraphs of Read and Dohmen.
منابع مشابه
Chromatic polynomials of some mixed hypergraphs
Motivated by a recent result of Walter [Electron. J. Combin. 16 (2009), R94] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into bl...
متن کاملOn Multivariate Chromatic Polynomials of Hypergraphs and Hyperedge Elimination
In this paper we introduce multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously investigated for graphs by Averbouch, Godlin, and Makowsky. The multivariate chromatic polynomial is an equivalent polynomial defined in terms of colorings, a...
متن کاملRecursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs
In response to a problem of Voloshin, we find recursive formulae for the chromatic polyno-mials of complete r-uniform interval hypergraphs and cohypergraphs. We also give recursive formulae for the chromatic polynomials of complete 3-uniform and 4-uniform interval bihy-pergraphs and comment on the challenges for general r. Our method is to exploit the uniform and complete structure of these hyp...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملChromatic Polynomials Of Some (m, l)-Hyperwheels
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform (m, l)− hyperwheels and non-uniform (m, l)−hyperfans. These hypergraphs, constructed through a “join” graph operation, are some generalizations of the well-known wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 20 شماره
صفحات -
تاریخ انتشار 2000